Constacyclic codes over F_q + u F_q + v F_q + u v F_q
نویسندگان
چکیده
Let q be a prime power and Fq be a finite field. In this paper, we study constacyclic codes over the ring Fq + uFq + vFq + uvFq, where u 2 = u, v2 = v and uv = vu. We characterize the generator polynomials of constacyclic codes and their duals using some decomposition of this ring. Finally we study the images of self-dual cyclic codes over F2m + uF2m + vF2m + uvF2m through a linear Gray map.
منابع مشابه
Construction of skew cyclic and skew constacyclic codes over Fq+uFq+vFq
In this paper, skew cyclic and skew constacyclic codes over finite non-chain ring R = F_q+uF_q+vF_q, where q= p^m, p is an odd prime and u^{2}=u, v^{2}=v, uv=vu=0 are studied. We show that Gray image of a skew cyclic code of length n over R is a skew quasi-cyclic code of length 3n over F_q of index 3. Structural properties of skew cyclic and skew constacyclic over R are obtained. Further, gener...
متن کاملSelf-Dual Codes better than the Gilbert-Varshamov bound
We show that every self-orthogonal code over $\mathbb F_q$ of length $n$ can be extended to a self-dual code, if there exists self-dual codes of length $n$. Using a family of Galois towers of algebraic function fields we show that over any nonprime field $\mathbb F_q$, with $q\geq 64$, except possibly $q=125$, there are self-dual codes better than the asymptotic Gilbert--Varshamov bound.
متن کاملFurther factorization of xn-1 over a finite field
Let $\Bbb F_q$ be a finite field with $q$ elements and $n$ a positive integer. Mart\'inez, Vergara and Oliveira \cite{MVO} explicitly factorized $x^{n} - 1$ over $\Bbb F_q$ under the condition of $rad(n)|(q-1)$. In this paper, suppose that $rad(n)\nmid (q-1)$ and $rad(n)|(q^w-1)$, where $w$ is a prime, we explicitly factorize $x^{n}-1$ into irreducible factors in $\Bbb F_q[x]$ and count the num...
متن کاملOn Codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$
In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and present construction of formally self-dual codes over $R$. Further, we give bounds on the minimum distance of LCD codes over $\F_q$ and extend these to codes ove...
متن کاملPermutation polynomials on F_q induced from bijective Redei functions on subgroups of the multiplicative group of F_q
We construct classes of permutation polynomials over FQ2 by exhibiting classes of low-degree rational functions over FQ2 which induce bijections on the set of (Q + 1)-th roots of unity. As a consequence, we prove two conjectures about permutation trinomials from a recent paper by Tu, Zeng, Hu and Li.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1507.03084 شماره
صفحات -
تاریخ انتشار 2015